Verifying qualitative and quantitative properties with LTL over concrete domains
نویسنده
چکیده
We introduce different extensions of LTL where propositional variables are replaced by constraints interpreted in Z. We show different decidability and complexity results for the satisfiability and model checking problems of these logics. The extension of LTL over a wide set of qualitative constraints is shown to be pspace-complete. When introducing some quantitative constraints, we must consider strong restrictions to regain decidability.
منابع مشابه
A CEGAR-like Approach for Cost LTL Bounds
Qualitative formal verification, that seeks boolean answers about the behavior of a system, is often insufficient for practical purposes. Observing quantitative information is of interest, e.g. for the proper calibration of a battery or a real-time scheduler. Historically, the focus has been on quantities in a continuous domain, but recent years showed a renewed interest for discrete quantitati...
متن کاملMBT 2007 Testing Planning Domains ( without Model Checkers ) 1
We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning domains which is self-contained, in the sense that flight rules are verified using a planner and no external tools are required. We review and analyse coverage conditions for requirements-based testing, and we reason i...
متن کاملPv: a Model-checker for Verifying Ltl-x Properties
We present a veri cation tool PV (Protocol Veri er) that checks stutter-free LTL (LTL-X) properties using a new partial order reduction algorithm called Two phase. Two phase signi cantly reduces space and time requirements on many practically important protocols on which the partial order reduction algorithms implemented in previous tools [God95, HP94, Pel96] yield very little savings. In some ...
متن کاملLTL Semantic Tableaux and Alternating $\omega$-automata via Linear Factors
Linear Temporal Logic (LTL) is a widely used specification framework for linear time properties of systems. The standard approach for verifying such properties is by transforming LTL formulae to suitable ω-automata and then applying model checking. We revisit Vardi’s transformation of an LTL formula to an alternating ω-automaton and Wolper’s LTL tableau method for satisfiability checking. We ob...
متن کاملIntegrating LTL Model Checking with Automated Theorem Proving
Theorem proving is a general-purpose veriication technique that typically needs to be guided by human insight whereas model checking works in the more constrained domain of essentially nite-state systems but is largely automatic. There are several advantages to integrating the two techniques since theorem proving can be used to compose proofs where individual steps or lemmas have been veriied u...
متن کامل